Kedlaya’s Algorithm in Larger Characteristic
نویسنده
چکیده
We show that the linear dependence on p of the running time of Kedlaya’s point-counting algorithm in characteristic p can be reduced to p1/2, at least in the simplest case of an elliptic curve over the prime field.
منابع مشابه
Computing zeta functions in families of Ca,b curves using deformation
We apply deformation theory to compute zeta functions in a family of Ca,b curves over a finite field of small characteristic. The method combines Denef and Vercauteren’s extension of Kedlaya’s algorithm to Ca,b curves with Hubrechts’ recent work on point counting on hyperelliptic curves using deformation. As a result, it is now possible to generate Ca,b curves suitable for use in cryptography i...
متن کاملAn Extension of Kedlaya's Algorithm to Artin-Schreier Curves in Characteristic 2
In this paper we present an extension of Kedlaya’s algorithm for computing the zeta function of an Artin-Schreier curve over a finite field Fq of characteristic 2. The algorithm has running time O(g log q) and needs O(g log q) storage space for a genus g curve. Our first implementation in MAGMA shows that one can now generate hyperelliptic curves suitable for cryptography in reasonable time. We...
متن کاملComputing Zeta Functions in Families of Ca, b
We apply deformation theory to compute zeta functions in a family of Ca,b curves over a finite field of small characteristic. The method combines Denef and Vercauteren’s extension of Kedlaya’s algorithm to Ca,b curves with Hubrechts’ recent work on point counting on hyperelliptic curves using deformation. As a result, it is now possible to generate Ca,b curves suitable for use in cryptography i...
متن کاملCounting points on Cab curves using Monsky-Washnitzer cohomology
We describe an algorithm to compute the zeta function of any Cab curve over any finite field Fpn . The algorithm computes a p-adic approximation of the characteristic polynomial of Frobenius by computing in the Monsky-Washnitzer cohomology of the curve and thus generalizes Kedlaya’s algorithm for hyperelliptic curves. For fixed p the asymptotic running time for a Cab curve of genus g over Fpn i...
متن کاملMemory efficient hyperelliptic curve point counting
Let E be a hyperelliptic curve of genus g over a finite field of degree n and small characteristic. Using deformation theory we present an algorithm that computes the zeta function of E in time essentially cubic in n and quadratic memory. This improves substantially upon Kedlaya’s result which has the same time asymptotic, but requires cubic memory size. AMS (MOS) Subject Classification Codes: ...
متن کامل